Flexible Blackbox: Preliminary Results
نویسندگان
چکیده
We argued in our Flexible Graphplan (FGP) work that the classical definition of the planning problem is too rigid to capture the full subtlety of many real problems. In light of this, we provided a new flexible definition and described a solution strategy based upon the Graphplan framework. Under this definition an action must determine how well its preconditions are met and assert a relative satisfaction degree along with its effects. In this paper, we describe how the Blackbox framework can be modified to solve the same flexible problem. Our Flexible Blackbox (FBB) system can synthesise a range of plans for a given flexible problem, trading the compromises made in a plan versus plan length in the same manner as FGP. We detail the modifications required and provide empirical results that compare our implementation of FBB with our FGP solver on a range of flexible problems and against vanilla Blackbox, STAN, IPP, and Graphplan on imperative problems.
منابع مشابه
On Combining 01X-Logic and QBF
We discuss how to combine 01X-logic and quantified boolean formulas (QBF) within a homogeneous SAT/QBF-framework in the context of bounded model checking of blackbox designs. The proposed combination allows a flexible handling of blackboxes w.r.t. computational resources. Preliminary results show the scalability of the approach.
متن کاملProvider Governance; A Basic Blackbox Seldom Looked at Properly: A Response to Recent Commentaries
متن کامل
Practical Attribute-Based Encryption: Traitor Tracing, Revocation and Large Universe
In Ciphertext-Policy Attribute-Based Encryption (CP-ABE), a user’s decryption key is associated with attributes which in general are not related to the user’s identity, and the same set of attributes could be shared between multiple users. From the decryption key, if the user created a decryption blackbox for sale, this malicious user could be difficult to identify from the blackbox. Hence in p...
متن کاملTraceable CP-ABE on Prime Order Groups: Fully Secure and Fully Collusion-Resistant Blackbox Traceable
In Ciphertext-Policy Attribute-Based Encryption (CP-ABE), access policies associated with the ciphertexts are generally role-based and the attributes satisfying the policies are generally shared by multiple users. If a malicious user, with his attributes shared with multiple other users, created a decryption blackbox for sale, this malicious user could be difficult to identify from the blackbox...
متن کاملAlgebraic Independence and Blackbox Identity Testing
Algebraic independence is a fundamental notion in commutative algebra that generalizes independence of linear polynomials. Polynomials {f1, . . . , fm} ⊂ K[x1, . . . , xn] (over a field K) are called algebraically independent if there is no non-zero polynomial F such that F (f1, . . . , fm) = 0. The transcendence degree, trdeg{f1, . . . , fm}, is the maximal number r of algebraically independen...
متن کامل